Solving Counter Parity Games
نویسندگان
چکیده
We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic systems from the literature. We present an elementary algorithm for computing the exact value of a counter parity game, which both generalizes previous results and improves their complexity. To this end, we introduce a class of ω-regular games with imperfect information and imperfect recall, solve them using automata-based techniques, and prove a correspondence between finitememory strategies in such games and strategies in counter parity games.
منابع مشابه
Parity Games Played on Transition Graphs of One-Counter Processes
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [23] that deciding the winner is an ExpTime-complete problem. An important corollary of this result is that the μ-calculus model checking problem for pushdown processes is ExpTime-complete. As one-counter processes are special cases o...
متن کاملPreprocessing parity games with partial Gauss elimination
We investigate the use of partial Gauss elimination as a preprocessing step to parity game solving. Gauss elimination is a well-known technique for solving Boolean equation systems. We present an Θ(V ) time algorithm for exhaustive partial Gauss elimination on parity games. Experimental validation shows that this approach is probably not feasible for speeding up the solving of real-world parity...
متن کاملGeneralized Parity Games
We consider games where the winning conditions are disjunctions (or dually, conjunctions) of parity conditions; we call them generalized parity games. These winning conditions, while ω-regular, arise naturally when considering fair simulation between parity automata, secure equilibria for parity conditions, and determinization of Rabin automata. We show that these games retain the computational...
متن کاملAn experimental study of algorithms and optimisations for parity games, with an application to Boolean Equation Systems
We present an empirical study comparing algorithms for solving parity games. The problems that we solve all stem from the problem of model checking modal μ-calculus formulae against realistic specifications. We investigate the practical use of various optimisation techniques for solving parity games, showing that decomposition into strongly connected components and applying efficient algorithms...
متن کاملStuttering Equivalence for Parity Games
We study the process theoretic notion of stuttering equivalence in the setting of parity games. We demonstrate that stuttering equivalent vertices have the same winner in the parity game. This means that solving a parity game can be accelerated by minimising the game graph with respect to stuttering equivalence. While, at the outset, it might not be clear that this strategy should pay off, our ...
متن کامل